Evaluation of Cost Optimization for Travelling Salesman Problem (TSP) by Comparing Various Ant Colony Optimization (ACO) Algorithms
نویسندگان
چکیده
This paper introduces one of the most profound Swarm Intelligence-based approaches, namely Ant Colony Optimization (ACO). The different operators in ACO and their effect on the quality of solution are briefly discussed. The ACO algorithms variants like Ant System (AS), Elitist Ant System (EAS), Rankbased Ant System (ASrank), Min-Max based Ant System (MMAS) are detailed. The paper puts forth a strong case for applicability of ACO for more complex optimization problems.
منابع مشابه
A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملAnt Colony Optimization for Capacity Problems
This paper deals with the optimization of the capacity of a terminal railway station using the Ant Colony Optimization algorithm. The capacity of the terminal station is defined as the number of trains that depart from the station in unit interval of time. The railway capacity optimization problem is framed as a typical symmetrical Travelling Salesman Problem (TSP), with the TSP nodes represent...
متن کاملImplementation of Travelling Salesman Problem Using ant Colony Optimization
Within the Artificial Intelligence community, there is great need for fast and accurate traversal algorithms, specifically those that find a path from a start to goal with minimum cost. Cost can be distance, time, money, energy, etc. Travelling salesman problem (TSP) is a combinatorial optimization problem. TSP is the most intensively studied problem in the area of optimization. Ant colony opti...
متن کاملA modified elite ACO based avoiding premature convergence for travelling salesmen problem
The Travelling Salesmen Problem (TSP) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. In this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. Solving this problem seems hard because program statement is simple and leads this problem belonging to NP...
متن کاملA memetic ant colony optimization algorithm for the dynamic travelling salesman problem
Ant colony optimization (ACO) has been successfully applied for combinatorial optimization problems, e.g., the travelling salesman problem (TSP), under stationary environments. In this paper, we consider the dynamic TSP (DTSP), where cities are replaced by new ones during the execution of the algorithm. Under such environments, traditional ACO algorithms face a serious challenge: once they conv...
متن کامل